Chance-Constrained Two-Stage Unit Commitment Under Uncertain Load and Wind Power Output Using Bilinear Benders Decomposition
نویسندگان
چکیده
منابع مشابه
Chance Constrained Mixed Integer Program: Bilinear and Linear Formulations, and Benders Decomposition
In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a finite discrete scenario set. Through studying a non-traditional bilinear mixed integer formulation, we derive its linear counterparts and show that they could be stronger than existing linear formulations. We also develop a variant of Jensen’s inequa...
متن کاملNetwork-Constrained AC Unit Commitment Under Uncertainty: A Benders’ Decomposition Approach
This paper proposes an efficient solution approach based on Benders’ decomposition to solve a network-constrained ac unit commitment problem under uncertainty. The wind power production is the only source of uncertainty considered in this paper, which is modeled through a suitable set of scenarios. The proposed model is formulated as a two-stage stochastic programming problem, whose first-stage...
متن کاملIncorporating Wind Power Generation And Demand Response into Security-Constrained Unit Commitment
Wind generation with an uncertain nature poses many challenges in grid integration and secure operation of power system. One of these operation problems is the unit commitment. Demand Response (DR) can be defined as the changes in electric usage by end-use customers from their normal consumption patterns in response to the changes in the price of electricity over time. Further, DR can be also d...
متن کاملTwo-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty
In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...
متن کاملDecomposition algorithms for two-stage chance-constrained programs
We study a class of chance-constrained two-stage stochastic optimization problems where second-stage feasible recourse decisions incur additional cost. In addition, we propose a new model, where “recovery” decisions are made for the infeasible scenarios to obtain feasible solutions to a relaxed second-stage problem. We develop decomposition algorithms with specialized optimality and feasibility...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2017
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2017.2655078